High girth augmented trees are huge
نویسندگان
چکیده
منابع مشابه
High girth augmented trees are huge
Let G be a graph consisting of a complete binary tree of depth h together with one back edge leading from each leaf to one of its ancestors, and suppose that the girth ofG exceeds g. Let h = h(g) be the minimum possible depth of such a graph. The existence of such graphs, for arbitrarily large g, is proved in [2], where it is shown that h(g) is at most some version of the Ackermann function. He...
متن کاملHigh-girth cubic graphs are homomorphic to the Clebsch graph
We give a (computer assisted) proof that the edges of every graph with maximum degree 3 and girth at least 17 may be 5-colored (possibly improperly) so that the complement of each color class is bipartite. Equivalently, every such graph admits a homomorphism to the Clebsch graph (Fig. 1). Hopkins and Staton [11] and Bondy and Locke [2] proved that every (sub)cubic graph of girth at least 4 has ...
متن کاملOnline coloring graphs with high girth and high odd girth
We give an upper bound for the online chromatic number of graphs with high girth and for graphs with high oddgirth generalizing Kierstead’s algorithm for graphs that contain neither a C3 or C5 as an induced subgraph. keywords: online algorithms, combinatorial problems
متن کاملHigh-Girth Graphs Avoiding a Minor are Nearly Bipartite
Let H be a xed graph. We show that any H-minor free graph of high enough girth has a circular-chromatic number arbitrarily close to two. Equivalently, such graphs have homomorphisms into a large odd circuit. In particular, graphs of high girth and of bounded genus or bounded tree width are \nearly bipartite" in this sense. For example, any planar graph of girth at least 16 admits a homomorphism...
متن کاملInteracting with Huge Hierarchies: Beyond Cone Trees
This paper describes an implementation of a tool for visualizing and interacting with huge information hierarchies, and some preliminary empirical evaluation of the tool’s efficacy. Existing systems for visualizing huge hierarchies using cone trees ‘‘break down” once the hierarchy to be displayed exceeds roughly 1000 nodes, due to increasing visual clutter. This paper describes a system called ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2016
ISSN: 0097-3165
DOI: 10.1016/j.jcta.2016.06.004